Strong bias of group generators: an obstacle to the “product replacement algorithm”

Strong bias of group generators: an obstacle to the "product replacement algorithm"

Let G be a finite group. Efficient generation of nearly uniformly distributed random elements in G, starting from a given set of generators of G, is a central problem in computational group theory. In this paper we demonstrate a weakness in the popular “product replacement algorithm,” widely used for this purpose. The main results are the following. Let Nk(G) be the set of generating k-tuples o...

Unconscious Bias: An Obstacle to Cultural Competence.

Some Applications of Strong Product

Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u1, v1) is adjacent with v= (u2, v2) whenever (v1 = v2 and u1 is adjacent with u2) or (u1 = u2 and v1 is adjacent with v2) or (u1 is adjacent with u2 and v1 is adjacent with v2). In this paper, we first collect the earlier results about strong product and then we present applications of ...

ترجمه و تحقیق کتاب an introduction to the history of mysticism

پایان نامه ی ارائه شده ترجمه ی کتاب «an introduction to the history of mysticism» نوشته ی مارگارت اسمیت که وی پژوهشگر، خاورشناس و محقق برجسته ی تصوف و عرفان می باشد. موضوع اساسی و مهم این کتاب عرفان در ادیان مختلف است. نویسنده در ابتدا این کلمه را ریشه یابی کرده و سپس تعریفی از آن ارائه داده و آن را در ادیان مختلف مورد بحث قرار داده است و در هر فصل کتاب به معرفی عرفای آن دین یا عصر خاصی پرداخته...

Lost in Transit: Product Replacement Bias and Pricing to Market

We assume that product i has a constant hazard of adjusting, fi, in each month, where fi ∼ Beta(a, b). Let us denote the product’s lifetime by ni. These assumptions imply that the total number of price changes in a product’s lifetime is distributed according to the binomial distribution, xi ∼ Bin(ni, fi). We assume, furthermore, that fi is distributed according to the beta distribution, fi ∼ Be...